An improved local remeshing algorithm for moving boundary problems
نویسندگان
چکیده
منابع مشابه
Parallel local remeshing for moving body applications
This paper presents a parallel local remeshing approach on distributed parallel computers based on the message passing interfaces (MPI). In comparison to those existing approaches that require combining a single hole initially spanning multiple processors into one processor so that the sequential results can be reproduced, the proposed approach avoids this limit by decomposing the initially dis...
متن کاملThree-dimensional adaptive domain remeshing, implicit domain meshing, and applications to free and moving boundary problems
Article history: Received 25 March 2013 Received in revised form 30 December 2013 Accepted 6 January 2014 Available online 13 January 2014
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Applications of Computational Fluid Mechanics
سال: 2016
ISSN: 1994-2060,1997-003X
DOI: 10.1080/19942060.2016.1174888